Some restrictions on the weight enumerators of near-extremal ternary self-dual codes and quaternary Hermitian self-dual codes
نویسندگان
چکیده
We give restrictions on the weight enumerators of ternary near-extremal self-dual codes length divisible by 12 and quaternary Hermitian 6. consider for which there is a code 12m $$m =3,4,5,6$$ . Also we 6m =4,5,6$$
منابع مشابه
New extremal ternary self-dual codes
Compared to binary self-dual codes, few methods are known to construct ternary self-dual codes. In this paper, a construction method for ternary self-dual codes is presented. Using this method, a number of new extremal ternary self-dual codes are obtained from weighing matrices. In addition, a classification is given for extremal ternary self-dual codes of length 40 constructed from Hadamard ma...
متن کاملExtremal self-dual codes
In the present thesis we consider extremal self-dual codes. We mainly concentrate on Type II codes (binary doubly-even codes), which may theoretically exist for lengths n = 8k ≤ 3928. It is noteworthy that extremal Type II codes have been actually constructed only for 13 lengths, 136 being the largest. Over the last decades the study of extremal codes became inseparable from the study of their ...
متن کاملA Note on Weight Enumerators of Linear Self-dual Codes
A partial description of (complete) weight enumerators of linear self-dual codes is given. 0. Let F = Z/pZ, where p is a prime number. If C is a linear code on F of length n, i.e., a linear subspace in Fn, then its (complete) weight enumerator WC is defined to be
متن کاملOn extremal self-dual ternary codes of length 48
The notion of an extremal self-dual code has been introduced in 1 . As Gleason 2 remarks onemay use invariance properties of the weight enumerator of a self-dual code to deduce upper bounds on the minimum distance. Extremal codes are self-dual codes that achieve these bounds. The most wanted extremal code is a binary self-dual doubly even code of length 72 and minimum distance 16. One frequentl...
متن کاملOn involutions in extremal self-dual codes and the dual distance of semi self-dual codes
A classical result of Conway and Pless is that a natural projection of the xed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual [13]. In this paper we prove that the same holds for involutions under some (quite strong) conditions on the codes. In order to prove it, we introduce a new family of binary codes: the semi self-dual codes. A binary self-orthogo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2023
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-022-01172-7